Extending the Super Efficiency Method to Rank the Non-Extreme Efficient Units

نویسندگان

  • Payan, A. Department of Mathematics, Zahedan Branch, Islamic Azad University, Zahedan
  • Rahmani Parchikolaei, B. Department of Mathematics, Noor Branch, Islamic Azad University, Noor
چکیده مقاله:

This article will address the extension of super efficiency method to rank the non-extreme efficient decision making units. Many methodologies have introduced methods that can rank efficient units, amongst which, the super efficiency method due to its ability to provide meaningful geometrical as well as economic analyses has a significant place. But the common problem with all the super efficiency models is their inability to rank the non-extreme efficient units. The writing will first, introduce a method for finding a face with the smallest dimension including a non-extreme unit. In continuation, a new production possibility set is constructed by eliminating such surface. Removing such surface in done by eliminating decision making on the surface from production possibility set. Then, super efficiency of the non-extreme efficient unit can be measured under the new production possibility set. At conclusion, the proposed method will be clarified through an example and its results are compared with the existing methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

extending the super efficiency method to rank the non-extreme efficient units

this article will address the extension of super efficiency method to rank the non-extreme efficient decision making units. many methodologies have introduced methods that can rank efficient units, amongst which, the super efficiency method due to its ability to provide meaningful geometrical as well as economic analyses has a significant place. but the common problem with all the super efficie...

متن کامل

A generalized super-efficiency model for ranking extreme efficient DMUs in stochastic DEA

In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...

متن کامل

Utilizing Monte Carlo Method for Ranking Extreme Efficient Units in Data Envelopment Analysis

Data envelopment analysis (DEA) is a mathematical programming method for calculatingefficiency of decision making units (DMU). In calculating the efficiency score of unitsthrough DEA we may come up with some efficient units. But the question is among theseefficient units which of them is better. As we know, it is possible to rank inefficient unitsthrough efficiency score; however, for ranking e...

متن کامل

The super-efficiency procedure for outlier identification, not for ranking efficient units

In this paper, we conduct simulation experiments to evaluate the performance of two alternative uses of the superefficiency procedure in Data Envelopment Analysis (DEA). The first is for outlier identification and the second is for ranking efficient units. We find that the ranking procedure does not perform satisfactorily. In fact, the correlations between the true efficiency and the estimated ...

متن کامل

a generalized super-efficiency model for ranking extreme efficient dmus in stochastic dea

in this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (dmus) in stochastic data envelopment analysis (dea) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. it is shown that this deterministic model can be converted to a quadratic programming model. so fa...

متن کامل

Super-Turing or Non-Turing? Extending the Concept of Computation

“Hypercomputation” is often defined as transcending Turing computation in the sense of computing a larger class of functions than can Turing machines. While this possibility is important and interesting, this paper argues that there are many other important senses in which we may “transcend Turing computation.” Turing computation, like all models, exists in a frame of relevance, which underlies...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 6  شماره None

صفحات  93- 104

تاریخ انتشار 2016-02

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

کلمات کلیدی برای این مقاله ارائه نشده است

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023